Locally GCD domains and the ring $D+XD_S[X]$

نویسندگان

  • G. W. Chang Department of Mathematics Education‎, ‎Incheon National University‎, ‎Incheon 406-772‎, ‎Republic of Korea.
  • M. Zafruhhah Department of Mathematics‎, ‎Idaho State University‎, ‎Poca-tello‎, ‎ID 83209‎, ‎USA
  • T. Dumitrescu Facultatea de Matematica si Informatica‎, ‎University of‎ ‎Bucharest‎, ‎14 Academiei Str.‎, ‎Bucharest‎, ‎RO 010014‎, ‎Romania
چکیده مقاله:

An integral domain $D$ is called a emph{locally GCD domain} if $D_{M}$ is aGCD domain for every maximal ideal $M$ of $D$. We study somering-theoretic properties of locally GCD domains. E.g., we show that $%D$ is a locally GCD domain if and only if $aDcap bD$ is locally principalfor all $0neq a,bin D$, and flat overrings of a locally GCD domain arelocally GCD. We also show that the t-class group of a locally GCD domain isjust its Picard group. We study when a locally GCD domain is Pr"{u}fer or ageneralized GCD domain.We also characterize locally factorial domains as domains $D$ whose minimal prime idealsof a nonzero principal ideal are locally principal and discuss conditions that make them Krull domains.We use the $D+XD_{S}[X]$ construction to give someinteresting examples of locally GCD domains that are not GCD domains.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Harmonic Measure and “ Locally Flat ” Domains ∗

We will review work with Tatiana Toro yielding a characterization of those domains for which the harmonic measure has a density whose logarithm has vanishing mean oscillation. 2000 Mathematics Subject Classification: 31B25, 35R35, 42B35, 51M25.

متن کامل

Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers

We present simple and efficient algorithms for computing gcd and cubic residuosity in the ring of Eisenstein integers, Z[ζ], i.e. the integers extended with ζ, a complex primitive third root of unity. The algorithms are similar and may be seen as generalisations of the binary integer gcd and derived Jacobi symbol algorithms. Our algorithms take time O(n2) for n bit input. This is an improvement...

متن کامل

Locally Uniform Domains and Quasiconformal Mappings

We document various properties of the classes of locally uniform and weakly linearly locally connected domains. We describe the boundary behavior for quasiconformal ho-meomorphisms of these domains and exhibit certain metric conditions satissed by such maps. We characterize the quasiconformal homeomorphisms from locally uniform domains onto uniform domains. We furnish conditions which ensure th...

متن کامل

The gcd-sum function

The gcd-sum is an arithmetic function defined as the sum of the gcd’s of the first n integers with n : g(n) = ∑n i=1(i, n). The function arises in deriving asymptotic estimates for a lattice point counting problem. The function is multiplicative, and has polynomial growth. Its Dirichlet series has a compact representation in terms of the Riemann zeta function. Asymptotic forms for values of par...

متن کامل

The Locally F-approximation Property of Bounded Hyperconvex Domains

In this paper, we study the local property of bounded hyperconvex domains Ω which we can approximative each plurisubharmonic function u ∈ F(Ω) by an increasing sequence of plurisubharmonic functions defined on strictly larger domains.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 42  شماره 2

صفحات  263- 284

تاریخ انتشار 2016-04-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023